Performance Evaluation of Wireless Fair Scheduling

Recently, several wireless scheduling algorithms have been proposed. It is important to evaluate their performance to establish the QoS provision capabilities of wireless networks. In this paper, we define a Wired-Fair scheduling scheme which is fair and but not channel-efficient, a ChannelEfficient scheduling scheme which is not fair and a WirelessFair scheduling scheme that is both channel-efficient and fair. We evaluate their performance under different channel conditions for a symmetric two-flow scheduling scenario in terms of channel-efficiency and fairness.